Error-Correcting Keys in Relational Databases
نویسندگان
چکیده
Suppose that the entries of a relational database are collected in an unreliable way, that is the actual database may differ from the true database in at most one data of each individual. An error-correcting key is such a set of attributes, that the knowledge of the actual data of an individual in this set of attributes uniquely determines the individual. It is showed that if the minimal keys are of size at most k, then the smallest sizes of the minimal error-correcting keys can be ck and this is the best possible, all minimal error-correcting keys have size at most 3k.
منابع مشابه
Relational Databases in RDF: Keys and Foreign Keys
Today, most of the data on the web resides in relational databases. To make the data available for the semantic web mappings into RDF can be used. Such mappings should preserve the information about the structure of keys and foreign keys, because otherwise important semantic information is lost. In this paper, we discuss several possible ways to map relational databases into an RDF graph. We di...
متن کاملThe Number of Keys in Relational and Nested Relational Databases
Thalheim, B., The number of keys in relational and nested relational databases, Discrete Applied Mathematics 40 (1992) 265-282. Combinatorial propositions, concerning the maximal number of minimal keys are considered. It is shown that the results of Demetrovics about the maximal number of minimal keys on unbounded domains do not hold for finite domains. Using this result lower bounds for the si...
متن کاملApplication of Biometrics to Obtain High Entropy Cryptographic Keys
In this paper, a two factor scheme is proposed to generate cryptographic keys directly from biometric data, which unlike passwords, are strongly bound to the user. Hash value of the reference iris code is used as a cryptographic key and its length depends only on the hash function, being independent of any other parameter. The entropy of such keys is 94 bits, which is much higher than any other...
متن کاملEfficient Matching and Indexing of Graph Models in Content-Based Retrieval
ÐIn retrieval from image databases, evaluation of similarity, based both on the appearance of spatial entities and on their mutual relationships, depends on content representation based on Attributed Relational Graphs. This kind of modeling entails complex matching and indexing, which presently prevents its usage within comprehensive applications. In this paper, we provide a graphtheoretical fo...
متن کاملPossible and Certain SQL Key
Driven by the dominance of the relational model, the requirements of modern applications, and the veracity of data, we revisit the fundamental notion of a key in relational databases with NULLs. In SQL database systems primary key columns are NOT NULL by default. NULL columns may occur in unique constraints which only guarantee uniqueness for tuples which do not feature null markers in any of t...
متن کامل